全文获取类型
收费全文 | 3947篇 |
免费 | 959篇 |
国内免费 | 190篇 |
出版年
2024年 | 7篇 |
2023年 | 35篇 |
2022年 | 102篇 |
2021年 | 144篇 |
2020年 | 170篇 |
2019年 | 46篇 |
2018年 | 66篇 |
2017年 | 154篇 |
2016年 | 70篇 |
2015年 | 170篇 |
2014年 | 266篇 |
2013年 | 322篇 |
2012年 | 361篇 |
2011年 | 383篇 |
2010年 | 413篇 |
2009年 | 366篇 |
2008年 | 405篇 |
2007年 | 330篇 |
2006年 | 290篇 |
2005年 | 237篇 |
2004年 | 198篇 |
2003年 | 117篇 |
2002年 | 98篇 |
2001年 | 124篇 |
2000年 | 83篇 |
1999年 | 5篇 |
1998年 | 5篇 |
1997年 | 4篇 |
1989年 | 5篇 |
1988年 | 5篇 |
1986年 | 7篇 |
1985年 | 6篇 |
1984年 | 6篇 |
1982年 | 4篇 |
1981年 | 5篇 |
1980年 | 10篇 |
1979年 | 4篇 |
1978年 | 6篇 |
1977年 | 4篇 |
1976年 | 5篇 |
1975年 | 6篇 |
1974年 | 4篇 |
1973年 | 2篇 |
1972年 | 3篇 |
1971年 | 8篇 |
1970年 | 4篇 |
1969年 | 4篇 |
1968年 | 5篇 |
1967年 | 4篇 |
1966年 | 6篇 |
排序方式: 共有5096条查询结果,搜索用时 31 毫秒
41.
42.
43.
A common problem in life testing is to demonstrate that the mean time to failure, θ, exceeds some minimum acceptable value, say θ1, with a given confidence coefficient γ. When this is true, it is said that “θ1 has been demonstrated with a confidence γ”. In this paper a Sequential Bayes Procedure (SBP) for demonstrating (by means of. a probability statement) that θ exceeds θ1 is presented. The SBP differs from the classical procedure in the sense that a prior distribution is assumed on the parameter θ, calling for a Bayesian approach. The procedure is based on the sequence of statistics. 相似文献
44.
R. D. Wollmer 《海军后勤学研究》1970,17(2):207-216
This paper presents an algorithm for determining where to place intercepting units in order to maximize the probability of preventing an opposing force from proceeding from one particular node in an undirected network to another. The usual gaming assumptions are invoked; namely, the strategy for placing the units is known to the opponent and he will choose a path through the network which, based on this knowledge, maximizes his probability of successful traverse. As given quantities, the model requires a list of the arcs and nodes of the network, the number of intercepting units available to stop the opposing force, and the probabilities for stopping the opposition at the arcs and nodes as functions of the number of intercepting units placed there. From these quantities, the algorithm calculates the probabilities for placing the unit at the arcs and nodes when one intercepting unit is available, and the expected numbers of units to place at the arcs and nodes when multiple intercepting units are available. 相似文献
45.
46.
Consider an auction in which increasing bids are made in sequence on an object whose value θ is known to each bidder. Suppose n bids are received, and the distribution of each bid is conditionally uniform. More specifically, suppose the first bid X1 is uniformly distributed on [0, θ], and the ith bid is uniformly distributed on [Xi?1, θ] for i = 2, …?, n. A scenario in which this auction model is appropriate is described. We assume that the value θ is un known to the statistician and must be esimated from the sample X1, X2, …?, Xn. The best linear unbiased estimate of θ is derived. The invariance of the estimation problem under scale transformations in noted, and the best invariant estimation problem under scale transformations is noted, and the best invariant estimate of θ under loss L(θ, a) = [(a/θ) ? 1]2 is derived. It is shown that this best invariant estimate has uniformly smaller mean-squared error than the best linear unbiased estimate, and the ratio of the mean-squared errors is estimated from simulation experiments. A Bayesian formulation of the estimation problem is also considered, and a class of Bayes estimates is explicitly derived. 相似文献
47.
In this paper we present a new formulation of the quadratic assignment problem. This is done by transforming the quadratic objective function into a linear objective function by introducing a number of new variables and constraints. The resulting problem is a 0-1 linear integer program with a highly specialized structure. This permits the use of the partitioning scheme of Benders where only the original variables need be considered. The algorithm described thus iterates between two problems. The master problem is a pure 0-1 integer program, and the subproblem is a transportation problem whose optimal solution is shown to be readily available from the master problem in closed form. Computational experience on problems available in the literature is provided. 相似文献
48.
In this paper we address the question of deriving deep cuts for nonconvex disjunctive programs. These problems include logical constraints which restrict the variables to at least one of a finite number of constraint sets. Based on the works of Balas. Glover, and Jeroslow, we examine the set of valid inequalities or cuts which one may derive in this context, and defining reasonable criteria to measure depth of a cut we demonstrate how one may obtain the “deepest” cut. The analysis covers the case where each constraint set in the logical statement has only one constraint and is also extended for the case where each of these constraint sets may have more than one constraint. 相似文献
49.
A cutting plane scheme embedded in an implicit enumeration framework is proposed for ranking the extreme points of linear assignment problems. This method is capable of ranking any desired number of extreme points at each possible objective function value. The technique overcomes storage difficulties by being able to perform the ranking at any particular objective function value independently of other objective values. Computational experience on some test problems is provided. 相似文献
50.
This paper analyzes the problem of determining desirable spares inventory levels for repairable items with dependent repair times. The problem is important for repairable products such as aircraft engines which can have very large investment in spares inventory levels. While existing models can be used to determine optimal inventory spares levels when repair times are independent, the practical considerations of limited repair shop capacity and prioritized shop dispatching rules combine to make repair times not independent of one another. In this research a simulation model of a limited capacity repair facility with prioritized scheduling is used to explore a variety of heuristic approaches to the spares stocking decision. The heuristics are also compared with use of a model requiring independent repair times (even though that assumption is not valid here). The results show that even when repair time dependencies are present, the performance of a model which assumes independent repair times is quite good. 相似文献